By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers

James Abello

pp. 1-16

An Extremal Problem on Sparse 0-1 Matrices

Dan Bienstock and Ervin Györi

pp. 17-27

A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes

M. A. Bonuccelli

pp. 28-35

A Zero-One Law for Boolean Privacy

Benny Chor and Eyal Kushilevitz

pp. 36-47

A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound

E. G. Coffman, Jr. and P. W. Shor

pp. 48-57

The Cycle Construction

P. Flajolet and M. Soria

pp. 58-60

Analysis of a Compound Bin Packing Algorithm

Donald K. Friesen and Michael A. Langston

pp. 61-79

Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph

H. Galeana-Sánchez, L. Pastrana Ramírez, and H. A. Rincón-Mejía

pp. 80-83

Weak Three-Linking in Eulerian Dgraphs

T. Ibaraki and S. Poljak

pp. 84-98

Spanning Trees with Many Leaves

Daniel J. Kleitman and Douglas B. West

pp. 99-106

Tree-Matchings in Graph Processes

Tomasz Luczak and Andrzej Rucinnki

pp. 107-120

The Expected Capacity of Concentrators

Nicholas Pippenger

pp. 121-129

Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs

A. Schrijver

pp. 130-138

Representations of Graphs on a Cylinder

Roberto Tamassia and Ioannis G. Tollis

pp. 139-149